A planar latin square lacking automorphism
نویسندگان
چکیده
منابع مشابه
Automorphism Groups of Planar Graphs
By Frucht’s Theorem, every abstract finite group is isomorphic to the automorphism group of some graph. In 1975, Babai characterized which of these abstract groups can be realized as automorphism groups of planar graphs. In this paper, we give a more detailed description of these groups in two steps. First, we describe stabilizers of vertices in connected planar graphs as the class of groups cl...
متن کاملRandom Latin square graphs
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and seve...
متن کاملSquare-free Rings and Their Automorphism Group
Finite-dimensional square-freeK-algebras have been completely characterized by Anderson and D’Ambrosia as certain semigroup algebras A ∼= KξS over a square-free semigroup S twisted by some ξ ∈ Z (S,K), a two-dimensional cocycle of S with coefficients in the group of units K∗ of K. D’Ambrosia extended the definition of square-free to artinian rings with unity and showed every square-free ring ha...
متن کاملA class of orthogonal latin square graphs
An orthogonal latin square graph is a graph whose vertices are latin squares of the same order, adjacency being synonymous with orthogonality. We are interested in orthogonal latin square graphs in which each square is orthogonal to the Cayley table M of a group G and is obtained from M by permuting columns. These permutations, regarded as permutations of G, are orthomorphisms of G and the grap...
متن کاملRank 3 Latin square designs
A Latin square design whose automorphism group is transitive of rank at most 3 on points must come from the multiplication table of an elementary abelian p-group,
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1979
ISSN: 0097-3165
DOI: 10.1016/0097-3165(79)90037-2